Evolutionary Image Transition Using Random Walks

نویسندگان

  • Aneta Neumann
  • Bradley Alexander
  • Frank Neumann
چکیده

We present a study demonstrating how random walk algorithms can be used for evolutionary image transition. We design different mutation operators based on uniform and biased random walks and study how their combination with a baseline mutation operator can lead to interesting image transition processes in terms of visual effects and artistic features. Using feature-based analysis we investigate the evolutionary image transition behaviour with respect to different features and evaluate the images constructed during the image transition process.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Evolutionary Image Transition Based on Theoretical Insights of Random Processes

Evolutionary algorithms have been widely studied from a theoretical perspective. In particular, the area of runtime analysis has contributed significantly to a theoretical understanding and provided insights into the working behaviour of these algorithms. We study how these insights into evolutionary processes can be used for evolutionary art. We introduce the notion of evolutionary image trans...

متن کامل

Quasi-random Agents for Image Transition and Animation

Quasi-random walks show similar features as standard random walks, but with much less randomness. We utilize this established model from discrete mathematics and show how agents carrying out quasi-random walks can be used for image transition and animation. The key idea is to generalize the notion of quasi-random walks and let a set of autonomous agents perform quasi-random walks painting an im...

متن کامل

Stochastic Completion Field with Probabilistic Transition

The report is to present a new simple method of using the probabilistic transition to evaluate the stochastic completion field. It is found that by quantizing the imaging plane according to the actual line-up of the image pixels, the stochastic completion field with random walks can be well characterized by the transition probabilities. Those transition probabilities can be calculated from eith...

متن کامل

Branching Random Walks and Their Applications to Population Studies

Recent investigations have demonstrated that continuous-time branching random walks on multidimensional lattices give an important example of stochastic models in which the evolutionary processes depend on the structure of a medium and the spatial dynamics. It is convenient to describe such processes in terms of birth, death, and walks of particles on the lattice. The structure of a medium is d...

متن کامل

On Finite Geometric Random Walks and Probabilistic Combinatorics

In this paper we deene and analyze convergence of the geometric random walks. We show that the behavior of such walks is given by certain random matroid processes. In particular, the mixing time is given by the expected stopping time, and the cutoo is equivalent to a phase transition. We also discuss some random geometric random walks as well as some examples and symmetric cases.

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2017